Sweep coverage of discrete time multi-robot networks with general topologies
نویسندگان
چکیده
منابع مشابه
FINITE-TIME PASSIVITY OF DISCRETE-TIME T-S FUZZY NEURAL NETWORKS WITH TIME-VARYING DELAYS
This paper focuses on the problem of finite-time boundedness and finite-time passivity of discrete-time T-S fuzzy neural networks with time-varying delays. A suitable Lyapunov--Krasovskii functional(LKF) is established to derive sufficient condition for finite-time passivity of discrete-time T-S fuzzy neural networks. The dynamical system is transformed into a T-S fuzzy model with uncertain par...
متن کاملOptimal discrete-time control of robot manipulators in repetitive tasks
Optimal discrete-time control of linear systems has been presented already. There are some difficulties to design an optimal discrete-time control of robot manipulator since the robot manipulator is highly nonlinear and uncertain. This paper presents a novel robust optimal discrete-time control of electrically driven robot manipulators for performing repetitive tasks. The robot performs repetit...
متن کاملDiscrete Path Planning Strategies for Coverage and Multi-robot Rendezvous
This thesis addresses the problem of motion planning for autonomous robots, given a map and an estimate of the robot pose within it. The motion planning problem for a mobile robot can be defined as computing a trajectory in an environment from one pose to another while avoiding obstacles and optimizing some objective such as path length or travel time, subject to constraints like vehicle dynami...
متن کاملConsensus and synchronization in discrete-time networks of multi-agents with stochastically switching topologies and time delays
We analyze stability of consensus algorithms in networks of multi-agents with time-varying topologies and delays. The topology and delays are modeled as induced by an adapted process and are rather general, including i.i.d. topology processes, asynchronous consensus algorithms, and Markovian jumping switching. In case the self-links are instantaneous, we prove that the network reaches consensus...
متن کاملMulti-Robot Adversarial Coverage
This work discusses the problem of adversarial coverage, in which one or more robots are required to visit every point of a given area, which contains threats that might stop the robots. The objective of the robots is to cover the target area as quickly as possible, while maximizing the percentage of covered area before they are stopped. This problem has many real-world applications, from perfo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kybernetika
سال: 2014
ISSN: 0023-5954,1805-949X
DOI: 10.14736/kyb-2014-1-0019